On inherently ambiguous E0L languages

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inherently Ambiguous: Facial Expressions of Emotions, in Context

With a few yet increasing number of exceptions, the cognitive sciences enthusiastically endorsed the idea that there are basic facial expressions of emotions that are created by specific configurations of facial muscles. We review evidence that suggests an inherent role for context in emotion perception. Context does not merely change emotion perception at the edges; it leads to radical categor...

متن کامل

Parallel Parsing of Languages Generated by Ambiguous Bounded Context Grammars

Using the CRCW PRAM model, we describe a language recognition algorithm for an arbitrary grammar in the class of BCPP grammars 9]. (BCPP grammars, which admit ambiguity, are a generalization of both the NTS grammars 14] and Floyd's bounded context (BC) grammars 4].) Using n processors, the algorithm runs in time O(h log n) (O(h) in the case of an unambiguous grammar), where n is the length of t...

متن کامل

Ambiguous Solicitation: Ambiguous Prescription

We conduct a two-phase laboratory experiment, separated by several weeks. In the first phase, we conduct urn games intended to measure ambiguity aversion on a representative population of undergraduate students. In the second phase, we invite the students back with four different solicitation treatments, varying in the ambiguity of information regarding the task and the payout of the laboratory...

متن کامل

Inherently nonfinitely based lattices

We give a general method for constructing lattices L whose equational theories are inherently nonfinitely based. This means that the equational class (that is, the variety) generated by L is locally finite and that L belongs to no locally finite finitely axiomatizable equational class. We also provide an example of a lattice which fails to be inherently nonfinitely based but whose equational th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1983

ISSN: 0304-3975

DOI: 10.1016/0304-3975(83)90071-3